Sufficient Fritz John optimality conditions for nondifferentiable convex programming

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Enhanced Fritz John Conditions for Convex Programming

We consider convex constrained optimization problems, and we enhance the classical Fritz John optimality conditions to assert the existence of multipliers with special sensitivity properties. In particular, we prove the existence of Fritz John multipliers that are informative in the sense that they identify constraints whose relaxation, at rates proportional to the multipliers, strictly improve...

متن کامل

Sufficient global optimality conditions for general mixed integer nonlinear programming problems

‎In this paper‎, ‎some KKT type sufficient global optimality conditions‎ ‎for general mixed integer nonlinear programming problems with‎ ‎equality and inequality constraints (MINPP) are established‎. ‎We achieve‎ ‎this by employing a Lagrange function for MINPP‎. ‎In addition‎, ‎verifiable sufficient global optimality conditions for general mixed‎ ‎integer quadratic programming problems are der...

متن کامل

New Optimality Conditions for a Nondifferentiable Fractional Semipreinvex Programming Problem

In recent years, there has been an increasing interest in studying the develpoment of optimality conditions for nondifferentiable multiobjective programming problems. Many authors established and employed some different Kuhn and Tucker type necessary conditions or other type necessary conditions to research optimal solutions; see [1–27] and references therein. In [7], Lai and Ho used the Pareto...

متن کامل

Fritz-john and Kuhn-tucker Conditions in Non-linear Programming

In this paper we give necessary optimality conditions of Fritz-John and Kuhn-Tucker (KKT) conditions for non-linear infinite dimensional programming problem with operatorial constraints. We use an alternative theorem. Some of the known results in finite dimensional case have been extended to infinite dimensional case with suitable conditions.

متن کامل

On Sequential Optimality Conditions without Constraint Qualifications for Nonlinear Programming with Nonsmooth Convex Objective Functions

Sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. Here, nonsmooth approximate gradient projection and complementary approximate Karush-Kuhn-Tucker conditions are presented. These sequential optimality conditions are satisfied by local minimizers of optimization problems independently of the fulfillment of constrai...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Journal of the Australian Mathematical Society. Series B. Applied Mathematics

سال: 1976

ISSN: 0334-2700,1839-4078

DOI: 10.1017/s0334270000001326